A Stochastic Extension of the Routing Calculi

The modern distributed systems have not only functional requirements (i. e. absence of deadlock, livelock etc. ) but also have non-functional requirements (i. e. security, reliability, performance, Quality of Service(QoS) etc. ). The methods for checking their correctness and analyze their performance is at very primitive stage. In the last few decades, formal verification techniques such as process algebras offer a powerful and rigorous approach for establishing the correctness of computer systems. Routing calculi (a such process algebra which is an elaboration of asynchronous distributed Pi calculus ) which models a distributed networks with router as an active component in determining the path between communicating processes.